Adding closed world assumptions to well-founded semantics
نویسندگان
چکیده
منابع مشابه
Adding Closed World Assumptions to Well Founded Semantics
Pereira, L.M., J.J. Alferes, J.N. Aparicio, Adding closed world assumptions to well-founded semantics, Theoretical Computer Science 122 (1994) 49-68. Given a program P we specify an enlargement of its well-founded model which gives meaning to the adding of closed world assumptions. We do so by proposing the desirable principles of a closed world assumption (CWA), and proceed to formally define ...
متن کاملWell-Founded Semantics, Generalized
Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, three-valued, semantics uses ΦP , which extends TP to Kleene’s strong three-valued logic. Both these approaches generalize to cover logic programming systems based on a wide class of logics, provided only that the underlying structure be that of a bilattice. This was presented i...
متن کاملLocal closed world reasoning with description logics under the well-founded semantics
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases [52], and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. ...
متن کاملPossibilistic Well-Founded Semantics
Recently, a good set of logic programming semantics has been defined for capturing possibilistic logic program. Practically all of them follow a credulous reasoning approach. This means that given a possibilistic logic program one can infer a set of possibilistic models. However, sometimes it is desirable to associate just one possibilistic model to a given possibilistic logic program. One of t...
متن کاملAggregation and Well-Founded Semantics
Set-grouping and aggregation are powerful non-monotonic operations of practical interest in database query languages. We consider the problem of expressing aggregation via negation as failure (NF). We study this problem in the framework of partial-order clauses introduced in JOM95]. We show a translation of partial-order programs to normal programs that is very natural: Any cost-monotonic parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1994
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90201-1